Isolated calmness of solution mappings in convex semi-infinite optimization
نویسندگان
چکیده
منابع مشابه
Calmness Modulus of Linear Semi-infinite Programs
Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations of the objective function together with continuous perturbations of the right-hand side of the constraint system (with respect to an index ranging in a compact Hausdorff space). Specifically, we provide a lower bound ...
متن کاملMetric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
This paper is concerned with the Lipschitzian behavior of the optimal set of convex semi-infinite optimization problems under continuous perturbations of the right hand side of the constraints and linear perturbations of the objective function. In this framework we provide a sufficient condition for the metric regularity of the inverse of the optimal set mapping. This condition consists of the ...
متن کاملSemi-Infinite Optimization under Convex Function Perturbations: Lipschitz Stability
This paper is devoted to the study of the stability of the solution map for the parametric convex semi-infinite optimization problem under convex function perturbations in short, PCSI. We establish sufficient conditions for the pseudo-Lipschitz property of the solution map of PCSI under perturbations of both objective function and constraint set. The main result obtained is new even when the pr...
متن کاملA complete characterization of the robust isolated calmness of nuclear norm regularized convex optimization problems
In this paper, we provide a complete characterization of the robust isolated calmness of the KarushKuhn-Tucker (KKT) solution mapping for convex constrained optimization problems regularized by the nuclear norm function. This study is motivated by the recent work in [8], where the authors show that under the Robinson constraint qualification at a local optimal solution, the KKT solution mapping...
متن کاملCalmness of efficient solution maps in parametric vector optimization
The paper is concerned with the stability theory of the efficient solution map of a parametric vector optimization problem. Utilizing the advanced tools of modern variational analysis and generalized differentiation, we study the calmness of the efficient solution map. More explicitly, new sufficient conditions in terms of the Fréchet and limiting coderivatives of parametric multifunctions for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2009
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2008.08.005